Tree-Based Graph Algorithms for Some Parallel Computers
نویسنده
چکیده
This paper gives several optimal mesh computer, VLSI, and pyramid computer algorithms for determining properties of an arbitrary undirected graph, where the graph is given as an unordered collection of edges. The algorithms first find spanning trees and then use them to determine properties of the graph. By using edges, instead of requiring an entire adjacency matrix, these algorithms use only e time on a 2-dimensional mesh, instead of the (v) time required with matrix input. Further, the edge-based algorithms extend naturally to meshes of arbitrary dimension d, finishing in e time. All of the times are optimal, and the algorithms extend to VLSI and pyramid models.
منابع مشابه
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Given a connected and undirected graph, the quadratic minimum spanning tree problem consists offinding one spanning tree that minimizes a quadratic cost function. We first propose an integer program-ming formulation based on the reformulation-linearization technique and show that such a formulationis stronger than previous ones in the literature. We then introduce a novel type of fo...
متن کاملParallel CPU and GPU computations to solve the job shop scheduling problem with blocking
In this paper, we studied the parallelization of an exact method to solve the job shop scheduling problem with blocking JSB. We used a modeling based on graph theory exploiting the alternative graphs. We have proposed an original parallelization technique for performing a parallel computation in the various branches of the search tree. This technique is implemented on computers network, where t...
متن کاملMultilevel mesh partitioning for heterogeneous communication networks
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cu...
متن کاملAlgorithms Minimizing Peak Power on Mesh-Connected Systems
There are many situations in parallel computing where reducing power consumption is an important goal. We consider mesh-connected systems where each processor is connected to its neighbors in a regular grid, such as occurs in cellular automata, sensor networks, and some supercomputers, focusing on systems with myriad simple processors on a chip. Most algorithms for such computers assume that al...
متن کاملParallel Domain Decomposition and Iterativerefinement Algorithms
Algorithms for the solution of partial diierential equations based on a subdivision of the spatial domain, has received much interest in recent years. To a large extent this has been motivated by the new generation of parallel computers. This algorithmic approach can introduce independent parallel tasks of variable granularity, depending on the subdivision and can therefore be adapted to a wide...
متن کامل